Degree distribution in random planar graphs
نویسندگان
چکیده
منابع مشابه
Degree distribution in random planar graphs
Article history: Received 7 October 2009 Available online 6 May 2011
متن کاملThe maximum degree of random planar graphs
McDiarmid and Reed [‘On the maximum degree of a random planar graph’, Combin. Probab. Comput. 17 (2008) 591–601] showed that the maximum degree Δn of a random labeled planar graph with n vertices satisfies with high probability (w.h.p.) c1 logn < Δn < c2 logn, for suitable constants 0 < c1 < c2. In this paper, we determine the precise asymptotics, showing in particular that w.h.p. |Δn − c logn|...
متن کاملRandom planar graphs
We study various properties of the random planar graph Rn, drawn uniformly at random from the classPn of all simple planar graphs on n labelled vertices. In particular, we show that the probability thatRn is connected is bounded away from 0 and from 1.We also show for example that each positive integer k, with high probability Rn has linearly many vertices of a given degree, in each embedding R...
متن کاملRandom cubic planar graphs
We show that the number of labeled cubic planar graphs on n vertices with n even is asymptotically αnρn!, where ρ . = 3.13259 and α are analytic constants. We show also that the chromatic number of a random cubic planar graph that is chosen uniformly at random among all the labeled cubic planar graphs on n vertices is three with probability tending to e /4! . = 0.999568, and is four with probab...
متن کاملSampling properties of random graphs: the degree distribution.
We discuss two sampling schemes for selecting random subnets from a network, random sampling and connectivity dependent sampling, and investigate how the degree distribution of a node in the network is affected by the two types of sampling. Here we derive a necessary and sufficient condition that guarantees that the degree distributions of the subnet and the true network belong to the same fami...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series A
سال: 2011
ISSN: 0097-3165
DOI: 10.1016/j.jcta.2011.04.010